An M[X]/G/1 Queue with Bernoulli Schedule General Vacation Times, General Extended Vacations, Random Breakdowns, General Delay Times for Repairs to Start and General Repair Times
نویسندگان
چکیده
منابع مشابه
AnM[X]/G/1 Queue with Bernoulli Schedule General Vacation Times, General Extended Vacations, Random Breakdowns, General Delay Times for Repairs to Start and General Repair Times
Abstract This paper studies a batch arrival queueing system in which the server may face occasional random breakdowns. The repair process does not start immediately after a breakdown and there is a delay time waiting for repairs to start. Further, after every service completion the server has the option to leave for a vacation with probability p or continue serving with probability1 − p. The ma...
متن کاملDiscrete - Time / / 1 Retrial Queue with General Retrial Times , Working Vacations and Vacation Interruption
Abstract: We consider a discrete-time 1 X Geo G retrial queue with general retrial times, and introduce working vacations and vacation interruption policy into the retrial queue. Firstly, we analyze the stationary condition for the embedded Markov chain at the departure epochs. Secondly, using supplementary variable method, we obtain the stationary probability distribution and some performance ...
متن کاملAn Unreliable Server Retrial Queue with Two Phases of Service and General Retrial Times Under Bernoulli Vacation Schedule
Abstract: This paper deals with the steady state behavior of an M/G/1 retrial queue with two successive phases of service and general retrial times under Bernoulli vacation schedule for an unreliable server. While the server is working with any phase of service, it may breakdown at any instant and the service channel will fail for a short interval of time. The primary customers finding the serv...
متن کاملON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION
This paper analyzes a renewal input working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2011
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v3n4p8